Felicitous Labellings of Some Network Models
نویسندگان
چکیده
Building up graph models to simulate scale-free networks is an important method since graphs have been used in researching scale-free networks. One use labelled graphs for distinguishing objects of communication and information networks. In this paper some methods are given for constructing larger felicitous graphs from smaller graphs having special felicitous labellings, and some network models are shown to be felicitous.
منابع مشابه
Connections between labellings of trees
There are many long-standing conjectures related with some labellings of trees. It is important to connect labellings that are related with conjectures. We find some connections between known labellings of simple graphs.
متن کاملGeneralized edge-magic total labellings of models from researching networks
Graph labellings have been used in many applications, such as in the development of redundant arrays of independent disks which incorporate redundancy utilizing erasure codes, some algorithms, design of highly accurate optical gauging systems for use on automatic drilling machines, design of angular synchronization codes, design of optimal component layouts for certain circuit-board geometries,...
متن کاملImproper Graceful and Odd-graceful Labellings of Graph Theory
Abstract In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having graceful/odd-graceful labellings.
متن کاملRelaxed Graceful Labellings of Trees
A graph G on m edges is considered graceful if there is a labelling f of the vertices of G with distinct integers in the set {0, 1, . . . ,m} such that the induced edge labelling g defined by g(uv) = |f(u) − f(v)| is a bijection to {1, . . . ,m}. We here consider some relaxations of these conditions as applied to tree labellings: 1. Edge-relaxed graceful labellings, in which repeated edge label...
متن کاملModal Provability Foundations for Argumentation Networks
Given an argumentation network we associate with it a modal formula representing the ‘logical content’ of the network. We show a one-to-one correspondence between all possible complete Caminada labellings of the network and all possible models of the formula.
متن کامل